Approximate Analysis of Queueing Networks with Markovian Arrival Processes and Phase Type Service Times
نویسنده
چکیده
Open queueing networks with Markovian arrival processes and phase type service times are considered. A technique is proposed for the speciication of the models. Using such a speciication, a Markov chain can be generated automatically. Furthermore, this description can be used immediately for simulation. An approximate disaggregation{aggregation technique for nite state Markov chains is applied. Thus large models with many states can be solved, so large that the state probabilities could neither be stored nor calculated in any computer. Accurate approximations are obtained with diierent degrees of accuracy, depending on the investigated computational eeort.
منابع مشابه
Analytic Computation of End-to-end Delays in Queueing Networks with Batch Markovian Arrival Processes and Phase-type Service Times
This paper poposes an analytic approach to compute end-to-end delays in queueing networks composed of BMAP/PH/1 queues. The approximations for the first two moments of the end-to-end delays are based on corresponding moments for the delays at each node in the network. In a traffic-based decomposition of queueing networks, different techniques for the departure process approximation, including t...
متن کاملLoss Queueing Networks with Bursty Arrival Processes and Phase Type Service Times: Approximate Analysis
Open queueing networks with bursty arrival processes, phase type service times, and losses are considered. A technique is proposed for the speciication of the models. Using such a speci-cation, a Markov chain can be generated automatically. Furthermore, this description can be used immediately for simulation. An approximate disaggregation{aggregation technique for nite state Markov chains is ap...
متن کاملMulti-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)
In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...
متن کاملOn capturing dependence in point processes: Matching moments and other techniques
Providing probabilistic analysis of queueing models can be difficult when the input distributions are non-Markovian. In response, a plethora of methods have been developed to approximate a general renewal process by a process with the time between renewals being distributed as a phase type random variable, which allows the resulting queueing models to become analytically or numerically tractabl...
متن کاملAnalysis of an Infinite-Server Queue with Batch Markovian Arrival Streams
This paper considers an infinite-server queue with multiple batch Markovian arrival streams. The service time distribution of customers may be different for different arrival streams, and simultaneous batch arrivals from more than one stream are allowed. For this queue, we first derive a system of ordinary differential equations for the time-dependent matrix joint generating function of the num...
متن کامل